Edward H. Shortliffe Chapter 6 Details of the Revised Therapy Algorithm

The search is "small" in the sense that the size of

Where the accountants have fallen down, however, is in their reluctance and sometimes inability to make intensive studies of different equipment and to specify their requirements for equipment. As one authority in the field of electronic data processing has pointed out, "Accountants, unlike engineers, take the equipment as given without bothering to specify their own particular needs." But after all things are taken into consideration, it is of primary importance that the personnel who are handling the details of the investigation have a good knowledge of the particular application to be studied. Executives in many companies have been dissatisfied with the help received from outsiders who are expert programmers and who know a lot about equipment, but who are unfamiliar with business systems. In some companies executives have found that their own personnel, who know the firm's particular data processing system, after three or four months of experience in which to grasp the logics of the computer and the intricacies of programming, are much more valuable than such outside experts.

A new predicate calculus deduction system based on production rules is proposed. The system combines several developments in Artificial Intelligence and Automatic Theorem Proving research including the use of domain-specific inference rules and separate mechanisms for forward and backward reasoning. It has a clean separation between the data base, the production rules, and the control system. Goals and subgoals are maintained in an AND/OR tree structure. We introduce here a structure that is the dual of the AND/OR tree to represent assertions. The production rules modify these structures until they "connect" in a fashion that proves the goal theorem. Unlike some previous systems that used production rules, ours is not limited to rules in Horn Clause form. Unlike previous PLANNER-like systems, ours can handle the full range of predicate calculus expressions including those with quantified variables, disjunctions, and negations.

J. Do RAN 433 22 Chromosome classification and segmentation as exercises in knowing what to expect.

This paper describes some work on automatically generating finite counterexamples in topology, and the use of counterexamples to speed up proof discovery in intermediate analysis, and gives some examples theorems where human provers are aided in proof discovery by the use of examples.

Some of the more popular alternativo used to build knowledge systems are production systems, backward-chained reasoning, logic programming, heuristic search, and the Blackboard framework. Many of the applications implemented in production systems have been written in the OPS language [8]. In this framework, knowledge is represented as a set of homogeneous rules that are scanned for applicability in a data base that contains the current state of solution. Backward chaining also has a homogeneous set of rules, but the search for applicable rules is driven by a hierarchy of goals and sub-goals. The best known system for implementing this type of program is EMYCIN [4].

Arguments are presented in favor of the answer "yes". The intuitive appeal (or lack thereof) of probabilities is considered briefly. The theoretical adequacies of probabilistic methods are investigated by considering them in light of McCarthy's "typology of uses of non-monotonic reasoning." A quantitative approach which overcomes the usual need for a priori probabilities is presented. Some of the practical advantages of using probabilities in a production system are described.

This article presents an experiment in knowledge-intensive programming within a general problemsolv:ng production-system architecture called Soar In Soar, knowledge is encoded within a set of problem spaces.

Reprinted, with permission, from IEEE Acoustic, Speech and Signal Processing, Spring, 1984. ABSTRACT In the past fifteen years, artificial intelligence scientists have built several signal interpretation, or understanding, programs. These programs have combined "low" level signal processing algorithms with knowledge representation and reasoning techniques used in knowledge-based. HASP/SIAP is one such program that tries to interpret the meaning of passively collected sonar data. In this paper we explore some of the Al techniques that contribute in the "understanding" process. We also describe the organization of HASP/SIAP system as an example of a programming framework that show promise for applications in a class of similar problems.1 Using data from concealed hydrophone arrays, it must detect, localize, and ascertain the type of each ocean vessel within range. Tne presence and movements of submarines are of most interest, but there are strategic and tactical motives for monitoring all vessel types.